Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information
نویسنده
چکیده
Nondeterministic concurrent strategies—those strategies compatible with copy-cat behaving as identity w.r.t. composition—have been characterised as certain maps of event structures. This leads to a bicategory of general concurrent games in which the maps are nondeterministic concurrent strategies. This paper explores the consequences of extending concurrent games with (1) winning, losing and, implicitly, neutral configurations, and (2) access levels, to address situations where Player or Opponent have imperfect information as to what has occurred in the game. In both cases winning strategies are shown to form bicategories of games. The bicategories become equivalent to order-enriched categories when restricted to deterministic strategies.
منابع مشابه
Opacity Issues in Games with Imperfect Information
We study in depth the class of games with opacity condition, which are two-player games with imperfect information in which one of the players only has imperfect information, and where the winning condition relies on the information he has along the play. Those games are relevant for security aspects of computing systems: a play is opaque whenever the player who has imperfect information never ...
متن کاملA Perfect-Information Construction for Coordination in Games
We present a general construction for eliminating imperfect information from games with several players who coordinate against nature, and to transform them into two-player games with perfect information while preserving winning strategy profiles. The construction yields an infinite game tree with epistemic models associated to nodes. To obtain a more succinct representation, we define an abstr...
متن کاملBicategories of Concurrent Games
This paper summarises recent results on bicategories of concurrent games and strategies. Nondeterministic concurrent strategies, those nondeterministic plays of a game left essentially unchanged by composition with copy-cat strategies, have recently been characterized as certain maps of event structures. This leads to a bicategory of general concurrent games in which the maps are nondeterminist...
متن کاملAdditional Winning Strategies in Two-Player Games
We study the problem of checking whether a two-player reachability game admits more than a winning strategy. We investigate this in case of perfect and imperfect information, and, by means of an automata approach we provide a linear-time procedure and an exponential-time procedure, respectively. In both cases, the results are tight.
متن کاملStrategy Construction for Parity Games with Imperfect Information
We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids ...
متن کامل